The Combinatorial PP1-Binding Consensus Motif (R/K)x (0,1)V/IxFxx(R/K)x(R/K) Is a New Apoptotic Signature
نویسندگان
چکیده
BACKGROUND Previous studies established that PP1 is a target for Bcl-2 proteins and an important regulator of apoptosis. The two distinct functional PP1 consensus docking motifs, R/Kx((0,1))V/IxF and FxxR/KxR/K, involved in PP1 binding and cell death were previously characterized in the BH1 and BH3 domains of some Bcl-2 proteins. PRINCIPAL FINDINGS In this study, we demonstrate that DPT-AIF(1), a peptide containing the AIF(562-571) sequence located in a c-terminal domain of AIF, is a new PP1 interacting and cell penetrating molecule. We also showed that DPT-AIF(1) provoked apoptosis in several human cell lines. Furthermore, DPT-APAF(1) a bi-partite cell penetrating peptide containing APAF-1(122-131), a non penetrating sequence from APAF-1 protein, linked to our previously described DPT-sh1 peptide shuttle, is also a PP1-interacting death molecule. Both AIF(562-571) and APAF-1(122-131) sequences contain a common R/Kx((0,1))V/IxFxxR/KxR/K motif, shared by several proteins involved in control of cell survival pathways. This motif combines the two distinct PP1c consensus docking motifs initially identified in some Bcl-2 proteins. Interestingly DPT-AIF(2) and DPT-APAF(2) that carry a F to A mutation within this combinatorial motif, no longer exhibited any PP1c binding or apoptotic effects. Moreover the F to A mutation in DPT-AIF(2) also suppressed cell penetration. CONCLUSION These results indicate that the combinatorial PP1c docking motif R/Kx((0,1))V/IxFxxR/KxR/K, deduced from AIF(562-571) and APAF-1(122-131) sequences, is a new PP1c-dependent Apoptotic Signature. This motif is also a new tool for drug design that could be used to characterize potential anti-tumour molecules.
منابع مشابه
On the maximal ideal space of extended polynomial and rational uniform algebras
Let K and X be compact plane sets such that K X. Let P(K)be the uniform closure of polynomials on K. Let R(K) be the closure of rationalfunctions K with poles o K. Dene P(X;K) and R(X;K) to be the uniformalgebras of functions in C(X) whose restriction to K belongs to P(K) and R(K),respectively. Let CZ(X;K) be the Banach algebra of functions f in C(X) suchthat fjK = 0. In this paper, we show th...
متن کاملCharacterization of $delta$-double derivations on rings and algebras
The main purpose of this article is to offer some characterizations of $delta$-double derivations on rings and algebras. To reach this goal, we prove the following theorem:Let $n > 1$ be an integer and let $mathcal{R}$ be an $n!$-torsion free ring with the identity element $1$. Suppose that there exist two additive mappings $d,delta:Rto R$ such that $$d(x^n) =Sigma^n_{j=1} x^{n-j}d(x)x^{j-1}+Si...
متن کامل$k$-Total difference cordial graphs
Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...
متن کاملSome inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کامل3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کامل